Optimal strong Mal’cev conditions for omitting type 1 in locally finite varieties
نویسندگان
چکیده
We show that the class of locally finite varieties omitting type 1 has the following properties. This class (1) is definable by an idempotent, linear, strong Mal’cev condition in a language with one 4-ary function symbol. (2) is not definable by an idempotent, linear, strong Mal’cev condition in a language with only one function symbol of arity strictly less than 4. (3) is definable by an idempotent, linear, strong Mal’cev condition in a language with two 3-ary function symbols. (4) is not definable by an idempotent, linear, strong Mal’cev condition in a language with function symbols of arity less than 4 unless at least two of the symbols have arity 3.
منابع مشابه
Characterizations of Several Maltsev Conditions
Tame congruence theory identifies six Maltsev conditions associated with locally finite varieties omitting certain types of local behaviour. Extending a result of Siggers, we show that of these six Maltsev conditions only two of them are equivalent to strong Maltsev conditions for locally finite varieties. Besides omitting the unary type [24], the only other of these conditions that is strong i...
متن کاملOn Maltsev Conditions associated with omitting certain types of local structures
Tame congruence theory identifies six Maltsev conditions associated with locally finite varieties omitting certain subsets of types of local behaviour. Extending a result of Siggers, we show that of these six Maltsev conditions only two of them are equivalent to strong Maltsev conditions for locally finite varieties. Besides omitting the unary type [18], the only other of these conditions that ...
متن کاملFinite Axiomatizability of Congruence Rich Varieties
In this paper we introduce the notion of a congruence rich variety of algebras, and investigate which locally finite subvarieties of such a variety are relatively finitely based. We apply the results obtained to investigate the finite axiomatizability of an interesting variety generated by a particular five-element directoid. Roughly speaking, congruence rich varieties are those in which all la...
متن کاملPermutability of Tolerances with Factor and Decomposing Congruences
A variety V has tolerances permutable with factor congruences if for any A1, A2 of V and every tolerance T on A1 × A2 we have T ◦ Π1 = Π1 ◦ T and T ◦ Π2 = Π2 ◦ T , where Π1,Π2 are factor congruences. If B is a subalgebra of A1×A2, the congruences Θi = Πi∩B are called decomposing congruences. V has tolerances permutable with decomposing congruences if T ◦ Θi = Θi ◦ T (i = 1, 2) for each A1, A2 ∈...
متن کاملReading group: proof of the PCP theorem∗
Let Σ be a finite alphabet. An instance of the label cover problem for Σ is: • a bipartite graph (V1, V2, E), • for every (u, v) ∈ E, a function πu,v : Σ→ Σ. A solution to an instance is a pair of mappings s1 : V1 → Σ and s2 : V2 → Σ such that for all (u, v) ∈ E, πu,v(s1(u)) = s2(v). Proposition 1. Label cover over a 3-element alphabet is NP-hard. Definition 1. A (strong) Mal’cev condition (L,Σ...
متن کامل